A scaling limit for the length of the longest cycle in a sparse random digraph

We discuss the length of the longest directed cycle in the sparse random digraph , constant. We show that for large there exists a function such that a.s. The function where is a polynomial in . We are only able to explicitly give the values , although we could in principle compute any .     

Periods of generalized Fermat curves

Let $k,n\ge 2$ be integers. A generalized Fermat curve of type $(k,n)$ is a compact Riemann surface S that admits a subgroup of conformal automorphisms $H\le \text{Aut}(S)$ isomorphic to ${\mathbb{Z}}_k^n$, such that the quotient surface $S/H$ is biholomorphic to the Riemann sphere $\stackrel{?}{\mathbb{C}}$ and has $n+1$ branch points, each one of order k. There exists a good algebraic model for these objects, which makes them easier to study. Using tools from algebraic topology and integration theory on Riemann surfaces, we find a set of generators for the first homology group of a generalized Fermat curve. Finally, with this information, we find a set of generators for the period lattice of the associated Jacobian variety.     

Solvent‐free ring‐opening polymerization of lactones with hydrogen‐bonding bisurea catalyst

Development of effective organocatalysts for the living ring‐opening polymerization (ROP) of lactones is highly desired for the preparation of biocompatible and biodegradable polyesters with controlled microstructures and physical properties. Herein, a new class of hydrogen‐bond donating bisurea catalysts is reported for the ROP of lactones under solvent‐free conditions. ROP of lactones mediated by the bisurea/7‐methyl‐1,5,7‐triazabicyclo[4.4.0]dec‐5‐ene (MTBD) catalyst exhibits a living/controlled manner, affording the polymers and copolymers with the well‐defined structure, predictable molecular weight, narrow molecular weight distribution, and high selectivity for monomer at low catalyst loadings at ambient temperature. The possible mechanism of bisurea/MTBD‐catalyzed ROP of lactones is proposed, in which the bisurea activates the carbonyl group of lactones while MTBD facilitates the nucleophilic attack of the initiating/propagating alcohol by hydrogen bonding. Moreover, the poly(ε‐caprolactone‐co‐δ‐valerolactone) [P(CL‐co‐VL)] random copolymers with various compositions were synthesized using the bisurea/MTBD catalyst. The measurements of thermal properties and crystalline structure demonstrate that the CL and VL units are cocrystallized in the crystalline phase of P(CL‐co‐VL) copolymers. © 2018 Wiley Periodicals, Inc. J. Polym. Sci., Part A: Polym. Chem. 2019 , 57, 90–100     

Existential monadic second order logic of undirected graphs: The Le Bars conjecture is false

In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) on undirected graphs. He proved that there exists an EMSO sentence ? such that $\mathsf{P}(G_n??)$ does not converge as $n\to \infty$ (here, the probability distribution is uniform over the set of all graphs on the labeled set of vertices $\{1,\dots ,n\}$). In the same paper, he conjectured that, for EMSO sentences with 2 first order variables, the zero-one law holds. In this paper, we disprove this conjecture.     

次线性期望下的一般中心极限定理

受Peng-中心极限定理的启发,本文主要应用G-正态分布的概念,放宽Peng-中心极限定理的条件,在次线性期望下得到形式更为一般的中心极限定理.首先,将均值条件E[X_n]=ε[X_n]=0放宽为|E[X_n]|+|ε[X_n]|=O(1/n);其次,应用随机变量截断的方法,放宽随机变量的2阶矩与2+δ阶矩条件;最后,将该定理的Peng-独立性条件进行放宽,得到卷积独立随机变量的中心极限定理.     

Compressibility of random walker trajectories on growing networks

We find that the simple coupling of network growth to the position of a random walker on the network generates a traveling wave in the probability distribution of nodes visited by the walker. We argue that the entropy of this probability distribution is bounded as the network size tends to infinity. This means that the growth of a space coupled to a random walker situated in it constrains its dynamics to a set of typical random walker trajectories, and walker trajectories inside the growing space are compressible.